Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/TRCSRSLASHEx9_Luc04

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X1)
TOP₁(mark₁(X)) -> PROPER₁(X)
ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X1)
ACTIVE₁(f₃(X1, X2, X3)) -> F₃(active₁(X1), X2, X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X3)
ACTIVE₁(f₃(a, b, X)) -> F₃(X, X, X)
F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
ACTIVE₁(f₃(X1, X2, X3)) -> F₃(X1, X2, active₁(X3))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X2)
PROPER₁(f₃(X1, X2, X3)) -> F₃(proper₁(X1), proper₁(X2), proper₁(X3))
F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)
F₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> F₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X1)
TOP₁(mark₁(X)) -> PROPER₁(X)
ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X1)
ACTIVE₁(f₃(X1, X2, X3)) -> F₃(active₁(X1), X2, X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X3)
ACTIVE₁(f₃(a, b, X)) -> F₃(X, X, X)
F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
ACTIVE₁(f₃(X1, X2, X3)) -> F₃(X1, X2, active₁(X3))
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X2)
PROPER₁(f₃(X1, X2, X3)) -> F₃(proper₁(X1), proper₁(X2), proper₁(X3))
F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)
F₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> F₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 6 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)
F₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> F₃(X1, X2, X3)
F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> F₃(X1, X2, X3)

The remaining pairs can at least by weakly be oriented.

F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)
F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = x2
mark₁(x1) = x1
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)
F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(mark₁(X1), X2, X3) -> F₃(X1, X2, X3)

The remaining pairs can at least by weakly be oriented.

F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = x1
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₃(X1, X2, mark₁(X3)) -> F₃(X1, X2, X3)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₃(x1, x2, x3) = F₁(x3)
mark₁(x1) = mark₁(x1)

Lexicographic Path Order [19].
Precedence:

mark₁ > F₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X2)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X1)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X3)
PROPER₁(f₃(X1, X2, X3)) -> PROPER₁(X2)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
f₃(x1, x2, x3) = f₃(x1, x2, x3)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X3)

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X1)
ACTIVE₁(f₃(X1, X2, X3)) -> ACTIVE₁(X3)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
ACTIVE₁(x1) = ACTIVE₁(x1)
f₃(x1, x2, x3) = f₂(x1, x3)

Lexicographic Path Order [19].
Precedence:

f₂ > ACTIVE₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(f₃(a, b, X)) -> mark₁(f₃(X, X, X))
active₁(c) -> mark₁(a)
active₁(c) -> mark₁(b)
active₁(f₃(X1, X2, X3)) -> f₃(active₁(X1), X2, X3)
active₁(f₃(X1, X2, X3)) -> f₃(X1, X2, active₁(X3))
f₃(mark₁(X1), X2, X3) -> mark₁(f₃(X1, X2, X3))
f₃(X1, X2, mark₁(X3)) -> mark₁(f₃(X1, X2, X3))
proper₁(f₃(X1, X2, X3)) -> f₃(proper₁(X1), proper₁(X2), proper₁(X3))
proper₁(a) -> ok₁(a)
proper₁(b) -> ok₁(b)
proper₁(c) -> ok₁(c)
f₃(ok₁(X1), ok₁(X2), ok₁(X3)) -> ok₁(f₃(X1, X2, X3))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.